首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3927篇
  免费   91篇
  国内免费   46篇
化学   2725篇
晶体学   25篇
力学   53篇
数学   691篇
物理学   570篇
  2023年   18篇
  2021年   34篇
  2020年   24篇
  2019年   48篇
  2018年   22篇
  2017年   32篇
  2016年   75篇
  2015年   52篇
  2014年   67篇
  2013年   195篇
  2012年   172篇
  2011年   203篇
  2010年   103篇
  2009年   83篇
  2008年   250篇
  2007年   263篇
  2006年   274篇
  2005年   274篇
  2004年   211篇
  2003年   144篇
  2002年   142篇
  2001年   56篇
  2000年   62篇
  1999年   53篇
  1998年   42篇
  1997年   47篇
  1996年   65篇
  1995年   49篇
  1994年   53篇
  1993年   39篇
  1992年   41篇
  1991年   32篇
  1990年   34篇
  1989年   26篇
  1988年   32篇
  1987年   37篇
  1986年   48篇
  1985年   63篇
  1984年   63篇
  1983年   51篇
  1982年   43篇
  1981年   49篇
  1980年   58篇
  1979年   37篇
  1978年   47篇
  1977年   39篇
  1976年   31篇
  1975年   31篇
  1974年   28篇
  1973年   34篇
排序方式: 共有4064条查询结果,搜索用时 906 毫秒
21.
22.
23.
2-Cyanoethyl anilines were controllably cleaved by 1 equiv of potassium t-butoxide in dry THF with a reaction that can be used in situ with the Wittig reaction to synthesize conjugated primary and secondary anilines.  相似文献   
24.
Three inverse problems for a Sturm-Liouville boundary value problem −y″+qy=λy, y(0)cosα=y′(0)sinα and y′(1)=f(λ)y(1) are considered for rational f. It is shown that the Weyl m-function uniquely determines α, f, and q, and is in turn uniquely determined by either two spectra from different values of α or by the Prüfer angle. For this it is necessary to produce direct results, of independent interest, on asymptotics and oscillation.  相似文献   
25.
26.
The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {si,ti} of G, find a minimum set of edges of G whose removal disconnects each si from the corresponding ti. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut.  相似文献   
27.
A nonlinear Lorenz model describing interactions between charged particles and combined ac-dc electromagnetic fields is studied for various combinations of frequencies, field strengths and relative angle (θ) between the ac and dc magnetic fields. Strong directional effects on the magnitude and location of resonant particle motion are observed when θ is varied and the regular resonance windows in the aligned field (θ = 0) and linear version of the model studied previously by Durney etaal., break up to form irregular and less well pronounced regions of large and small particle displacements when nonlinearities are taken into account. The length of time takne to achieve resonant behaviour also becomes larger and more variable when nonlinearities are present. The possible relevance of these effects to interactions between electromagnetic fields and biological media is briefly discussed.  相似文献   
28.
29.
We construct a family of partially ordered sets (posets) that are q-analogs of the set partition lattice. They are different from the q-analogs proposed by Dowling [5]. One of the important features of these posets is that their Whitney numbers of the first and second kind are just the q-Stirling numbers of the first and second kind, respectively. One member of this family [4] can be constructed using an interpretation of Milne [9] for S[n, k] as sequences of lines in a vector space over the Galois field F q. Another member is constructed so as to mirror the partial order in the subspace lattice.  相似文献   
30.
We show that if G is a random 3-regular graph on n vertices, then its dominating number, D(G), almost surely satisfies .2636nD(G) ≤ .3126n. © 1995 John Wiley & Sons, Inc.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号